A permutation-generating algorithm

Generating Transitive Permutation Groups

Integrated Strategy for Generating Permutation

An integrated strategy for generating permutation is presented in this paper. This strategy involves exchanging two consecutive elements to generate the starter sets and then applying circular and reversing operations to list all permutations. Some theoretical works are also presented. Mathematics Subject Classification: 05A05

An Algorithm For Generating Unconditional Exact Permutation Distribution For A Two-Sample Experiment

The IUFP Algorithm for Generating Simulation Heart

In all systems simulation, random variates are considered as a main factor and based of simulation heart. Actually, randomization is inducted by random variates in the simulation. Due to the importance of such a problem, a new method for generation of random variates from continuous distributions is presented in this paper. The proposed algorithm, called uniform fractional part (UFP) is simpler...

Probability Generating Functions for Sattolo’s Algorithm

In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...